翻訳と辞書 |
Lollipop sequence numbering : ウィキペディア英語版 | Lollipop sequence numbering Lollipop sequence numbering is a numbering scheme used in routing protocols. In this numbering scheme, sequence numbers start at a negative value, increase until they reach zero, then cycles through a finite set of positive numbers indefinitely. When a system is rebooted, the sequence is restarted from a negative number again. This allows recently rebooted systems to be distinguished from systems which have simply looped around their numbering space. This path can be visualized as a line with a circle at the end; hence a lollipop. Lollipop sequence numbering was originally believed to resolve the ambiguity problem in cyclic sequence numbering schemes, and was used in OSPF version 1 for this reason. Later work showed that this was not the case, and OSPF version 2 replaced it with a linear numbering space, with special rules for what happens when the sequence numbers reach the end of the numbering space. ==References==
* R. Perlman. "Fault-Tolerant Broadcasting of Routing Information." ''Computer Networks'', Vol. 7, December 1983, pp. 395–405.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Lollipop sequence numbering」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|